Models of Action Concurrency in Temporal Planning
نویسنده
چکیده
Models of temporal planning are complex, due to the possibility of multiple concurrent and mutually interacting actions. This work compares two modeling languages, one with a PDDL-style action exclusion mechanism, and another with an explicit notion of resources, and investigates their implications on constraint-based search. The first mechanism forces temporal gaps in action schedules and have a high performance penalty. The second mechanism avoids the gaps, with dramatically improved performance.
منابع مشابه
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of...
متن کاملTemporal Planning With Required Concurrency Using Classical Planning
In this paper we describe two novel algorithms for temporal planning. The first algorithm, TP, is an adaptation of the TEMPO algorithm. It compiles each temporal action into two classical actions, corresponding to the start and end of the temporal action, but handles the temporal constraints on actions through a modification of the Fast Downward planning system. The second algorithm, TPSHE, is ...
متن کاملWhen is Temporal Planning Really Temporal?
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristic...
متن کاملResearch in Concurrent Planning
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristic...
متن کاملTemporal Planning with a Non-Temporal Planner
This extended abstract looks at the work that I am currently undertaking in the field of temporal planning. Temporal planning is the same problem as classical planning but, whereas in classical planning all actions are considered to be instantaneous, in temporal planning time is also modelled. One possible way to achieve this is to introduce actions with duration. These durations can rely on th...
متن کامل